Reasoning with Defeasible Arguments: Examples and Applications

نویسنده

  • Gerard Vreeswijk
چکیده

This paper attempts to demonstrate the wide variety of characteristic properties of defeasible argumentation, of which nonmonotonicity is one. To do so, we introduce a simple formalism, called abstract argumentation system, with which we discuss different methods for raising arguments: forward reasoning, backward reasoning and, in particular, combinations thereof. Resource-bounded defeasible reasoning is also briefly dealt with (the prefix ‘defeasible’ is essential here). The main goal of this paper is not to tell how this should be done, but to show how these simple procedures suddenly may change in the context of defeasible argumentation. Research area 1985 Mathematics subject classification 68C01; 1987 CR classification scheme F.4.0, I.2.3, key words and phrases: nonmonotonic reasoning, defeasible argumentation, abstract argumentation system, argumentation sequence, resource-bounded defeasible reasoning.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Treatment of Defeasible Reasoning and its Implementation

Simari, G.R. and R.P. Loui, A mathematical treatment of defeasible reasoning and its implementation, Artificial Intelligence 53 (1992) 125-157. We present a mathematical approach to defeasible reasoning based on arguments. This approach integrates the notion of specificity introduced by Poole and the theory of warrant presented by Pollock. The main contribution of this paper is a precise, well-...

متن کامل

A Rgue ! - an Implemented System for Computer - Mediated Defeasible

This paper introduces the Argue!-system. It is an example of a system for computer-mediated defeasible argumentation, a new trend in the field of defeasible argumentation. In this research, computer systems are developed that can be used to mediate the process of argumentation of one or more users. Argument-mediation systems should be contrasted with systems for automated reasoning: the latter ...

متن کامل

A formal account of Socratic-style argumentation

In traditional mathematical models of argumentation an argument often consists of a chain of rules or reasons, beginning with premisses and leading to a conclusion that is endorsed by the party that put forward the argument. In informal reasoning, however, one often encounters a specific class of counterarguments that until now has received little attention in argumentation formalisms. The idea...

متن کامل

The Feasibility of Defeat in Defeasible Reasoning 3333333333333333333333333333

Systems of defeasible reasoning are characterized by defeasible proofs, called arguments. I claim that sensible criteria of defeat among arguments in those systems are feasible, be it to a certain extent. As defeat eventually becomes unenforceable, the only option left is to pursue both arguments concurrently. This paper tries to confine the reach of defeat among arguments by means of several c...

متن کامل

From systems for defeasible argumentation to dialogical systems of argumentation

Nonmonotonic reasoning is a reasoning in which temporary conclusions can be drawn on the basis of incomplete information but which might be withdrawn when more information becomes available. Systems for defeasible argumentation capture this kind of reasoning in terms of interactions between conflictual arguments. Nonmonotonic reasoning is explained in terms of defeasibility since arguments can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992